The Quantum Multiple-Access Channel with Cribbing Encoders

نویسندگان

چکیده

Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered, whereby Transmitter 2 performs measurement on system that entangled 1. Based the no-cloning theorem, perfect impossible. This leads to introduction of MAC model noisy cribbing. In causal and non-causal scenarios, before input 1 sent through channel. Hence, 2's may inflict "state collapse" for Achievable regions are derived each setting. Furthermore, regularized capacity characterization established robust cribbing, i.e. when contains all information input. Building analogy between relay channel, partial decode-forward region non-robust For classical-quantum encoders, determined classical input, cutset special case deterministic inner outer bounds coincide.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Multiple Access Channel with Correlated Sources and Cribbing Encoders

A discrete memoryless multiple access channel (MAC) is a quadruple { X1,X2, PY |X1,X2 ,Y } where X1,X2 are the input alphabets, Y the output alphabet, and PY |X1,X2 a transition probability matrix from X1 × X2 to Y . For shorthand notation, we will refer to the MAC by PY |X1,X2 . A source pair is a triplet {U ,V, PU,V } where PU,V is a distribution on U × V . We use the following notation: rand...

متن کامل

The Classical-Quantum Multiple Access Channel with Conferencing Encoders and with Common Messages

We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their private messages, but would also like to transmit common messages. In the second scenario (ccq-MAC with conferencing encoders), each sender has its own set of mes...

متن کامل

Multiple Access Channels with Cooperative Encoders and Channel State Information

cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with conferencing encoders (MACCE). For both situations, the two cases where the CSI is known to the encoders either non-causally or causally are studied. Achievable rate regions are established for both discrete mem...

متن کامل

The Multiple Access Channel with Causal and Strictly Causal Side Information at the Encoders

We study the state-dependent multiple access channel (MAC) with causal side information at the encoders. We consider two general models. In the first model, the state sequence is available at the two encoders in a strictly causal manner. We derive an achievable region, which is tight for the special case of a Gaussian MAC where the state sequence comprises the channel noise. Although the two se...

متن کامل

On the Multiple Access Channel with Asymmetric Noisy State Information at the Encoders

We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees of asymmetric noisy channel state information (CSI). For the case where the encoders observe causal, asymmetric noisy CSI and the decoder observes complete ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2022

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2022.3149827